Common arc method for diffraction pattern orientation
نویسندگان
چکیده
منابع مشابه
Processing a multifold ground penetration radar data using common-diffraction-surface stack method
Recently, the non-destructive methods have become of interest to the scientists in various fields. One of these method is Ground Penetration Radar (GPR), which can provide a valuable information from underground structures in a friendly environment and cost-effective way. To increase the signal-to-noise (S/N) ratio of the GPR data, multi-fold acquisition is performed, and the Common-Mid-Points ...
متن کاملNonlocal actin orientation models select for a unique orientation pattern
Many models have been developed to study the role of branching actin networks in motility. One important component of those models is the distribution of filament orientations relative to the cell membrane. Two mean-field models previously proposed are generalized and analyzed. In particular, we find that both models uniquely select for a dominant orientation pattern. In the linear case, the pa...
متن کاملIntroducing an Optimized Method for Obtaining X-ray Diffraction Patterns of Biological Tissues
Introduction Individual X-Ray diffraction patterns of biological tissues are obtained via interference of coherent scattering with their electrons. Many scientists have distinguished normal and cancerous breast tissue, bone density, and urinary stone types using the X-Ray diffraction patterns resulting from coherent scattering. The goal of this study was to introduce an optimized method for obt...
متن کاملThe Longest Common Subsequence Problem for Arc-Annotated Sequences
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The LONGEST ARC-PRESERVING COMMON SUBSEQUENCE (LAPCS) problem has recently been introduced in [P.A. Evans, Algorithms and complexity for annotated sequence analysis, PhD Thesis, University of Victoria, 1999; P.A. Evans, Finding common subsequences with arcs and pseudoknots, in: Proceeding...
متن کاملThe Longest Common Subsequence Problem for Arc-Annotated Sequences
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The longest arc-preserving common subsequence problem has been introduced in [1], [2] as a framework for studying the similarity of arc-annotated sequences. In this paper, we consider arc-annotated sequences with various arc structures. Mathematics Subject Classification: 68Q15
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica Section A Foundations of Crystallography
سال: 2011
ISSN: 0108-7673
DOI: 10.1107/s0108767311036269